Dedekind finiteness in topoi

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Copower Objects and Their Applications to Finiteness in Topoi

In this paper, we examine a new approach to topos theory – rather than considering subobjects, look at quotients. This leads to the notion of a copower object, which is the object of quotients of a given object. We study some properties of copower objects, many of which are similar to the properties of a power objects. Given enough categorical structure (i.e. in a pretopos) it is possible to ge...

متن کامل

A Note on Induction, Abstraction, and Dedekind-Finiteness

The purpose of this note is to present a simplification of the system of arithmetical axioms given in previous work; specifically, it is shown how the induction principle can in fact be obtained from the remaining axioms, without the need of explicit postulation. The argument might be of more general interest, beyond the specifics of the proposed axiomatization, as it highlights the interaction...

متن کامل

Numerology in Topoi

This paper studies numerals (see definition that immediately follows), natural numbers objects and, more generally, free actions, in a topos. A pre-numeral is a poset with a constant, 0, and a unary operation, s, such that: PN1) x ≤ y ⇒ sx ≤ sy PN2) x ≤ sx A numeral is a “minimal” pre-numeral, that is, one such that any s-invariant subobject containing 0 is entire. 1. Lemma. A pre-numeral is a ...

متن کامل

Sheaf representation for topoi

It is shown that every (small) topos is equivalent to the category of global sections of a sheaf of so-called hyperlocal topoi, improving on a result of Lambek & Moerdijk. It follows that every boolean topos is equivalent to the global sections of a sheaf of well-pointed topoi. Completeness theorems for higher-order logic result as corollaries. The main result of this paper is the following. Th...

متن کامل

Towards an Override in Topoi

Models of software systems are built in Z and VDM using partial functions between sets and certain operations on these partial functions : extension (t), restriction (/), removal (/ −) and override (†). Can these operations be given a categorial semantics? Doing so will show the ‘nature’ of the operations. The operation of override is found to depend on the ‘shape’ on X, the poset PX. The opera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1987

ISSN: 0022-4049

DOI: 10.1016/0022-4049(87)90130-7